CP-based Lagrangian Relaxation for a Multimedia Application
نویسنده
چکیده
منابع مشابه
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem
Whereas CP methods are strong with respect to the detection of local infeasibilities, OR approaches have powerful optimization abilities that ground on tight global bounds on the objective. An integration of propagation ideas from CP and Lagrangian relaxation techniques from OR combines the merits of both approaches. We introduce a general way of how linear optimization constraints can strength...
متن کاملA Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملLagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA Lagrangian relaxation approach to the edge-weighted clique problem
The b-clique polytope CP b is the convex hull of the node and edge incidence vectors of all subcliques of size at most b of a complete graph on n nodes. Including the Boolean quadric polytope QP as a special case and being closely related to the quadratic knapsack polytope, it has received considerable attention in the literature. In particular, the max-cut problem is equivalent with optimizing...
متن کامل